The Competitiveness of on - Line Demand Paging

We investigate the performance ofon-line demand paging algorithms (in comparison with the optimal off-line demand paging algorithms) for generalized two level memo­ ries, which are two level memories whose second level is composed of different speed memories. We consider and model variants of this problem which are of practical inter­ est. We especially investigate LRU and FIFO, which are both known as good demand paging algorithms for "ordinary" two level memories (ST], and which are widely used. We extend the results to the case in which the on-line algorithms are allowed to use additional primary memory frames.